package com.atguigu.dp;

//1.斐波那契数列 - 递归暴力求解
public class Demo01 {
    public static void main(String[] args) {
        for(int i = 0 ; i<=100 ; i++){
            System.out.println(i+"  :  " + fn(i));
        }
    }

    public static long fn(int n){
        if(n==0){
            return 0 ;
        }
        if(n==1){
            return 1 ;
        }
        return fn(n-1)+fn(n-2);
    }
}
